Polynomial Equivalence of Finite Rings
نویسندگان
چکیده
We prove that Zpn and Zp[t]/(t) are polynomially equivalent if and only if n ≤ 2 or p = 8. For the proof, employing Bernoulli numbers, we provide the polynomials which compute the carry-on part for the addition and multiplication in base p. As a corollary, we characterize finite rings of p elements up to polynomial equivalence.
منابع مشابه
A Dixmier-moeglin Equivalence for Skew Laurent Polynomial Rings
The work of Dixmier in 1977 and Moeglin in 1980 show us that for a prime ideal P in the universal enveloping algebra of a complex finite-dimensional Lie algebra the properties of being primitive, rational and locally closed in the Zariski topology are all equivalent. This equivalence is referred to as the Dixmier-Moeglin equivalence. In this thesis we will study skew Laurent polynomial rings of...
متن کاملGray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملSemistar dimension of polynomial rings and Prufer-like domains
Let $D$ be an integral domain and $star$ a semistar operation stable and of finite type on it. We define the semistar dimension (inequality) formula and discover their relations with $star$-universally catenarian domains and $star$-stably strong S-domains. As an application, we give new characterizations of $star$-quasi-Pr"{u}fer domains and UM$t$ domains in terms of dimension inequal...
متن کاملEquivariant Flow Equivalence for Shifts of Finite Type, by Matrix Equivalence over Group Rings
Let G be a finite group. We classify G-equivariant flow equivalence of nontrivial irreducible shifts of finite type in terms of (i) elementary equivalence of matrices over ZG and (ii) the conjugacy class in ZG of the group of G-weights of cycles based at a fixed vertex. In the case G = Z/2, we have the classification for twistwise flow equivalence. We include some algebraic results and examples...
متن کاملThe extended equivalence and equation solvability problems for groups
The algorithmic aspects of the equivalence problem and the equation solvability problem have received increasing attention in the past two decades. The equivalence problem for a finite algebra A asks whether or not two (term or polynomial) expressions s and t are equivalent over A (denoted by A |= s ≈ t), i.e. if s and t determine the same function over A. The equation solvability is one of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012